On the Isomorphism Conjecture for 2-DFA Reductions
نویسندگان
چکیده
The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for any class C that is closed under log-lin reductions: • All complete sets for the class C under 2DFA reductions are also complete under one-one, length-increasing 2DFA reductions and are first-order isomorphic. • The 2DFA-isomorphism conjecture is false, i.e., the complete sets under 2DFA reductions are not isomorphic to each other via 2DFA reductions.
منابع مشابه
On the Isomorphism Conjecture for Weak Reducibilities
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomialtime isomorphic to each other. In this paper, these two conjectures are investigated for reducibilities weaker than polynomial-time. It is...
متن کاملDescription and analysis of a bottom-up DFA minimization algorithm
We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongly connected DFA, the isomorphism problem for a set of strongly connected minimized DFAs, and the minimization of a connected DFA consisting in two strongly connected components, both of which are minimized. We apply this proced...
متن کاملPolynomial-Time Isomorphism of 1-L-Complete Sets
Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C under 1-L reductions are polynomialtime isomorphic to each other. We also generalize the result to reductions computed by finite-crossing machines. As a corollary, we show that all sets complete for C under 2-way DFA reductions are polynomial-time isomorphic to each other.
متن کامل1342 - 2812 One - Way Functions and the Isomorphism Conjecture
We study the Isomorphism Conjecture proposed by Berman and Hartmanis. It states that all sets complete for NP under polynomial-time many-one reductions are P-isomorphic to each other. From previous research it has been widely believed that all NP-complete sets are reducible each other by one-to-one and length-increasing polynomial-time reductions, but we may not hope for the full p-isomorphism ...
متن کاملThe isomorphism conjecture for constant depth reductions
For any class C closed under TC reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC reductions are isomorphic under u-uniform AC-computable isomorphisms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 7 شماره
صفحات -
تاریخ انتشار 1996